The jump is definable in the structure of the degrees of unsolvabilityCOOPER, S. B.Bulletin, new series, of the American Mathematical Society. 1990, Vol 23, Num 1, pp 151-158, issn 0273-0979, 8 p.Article

Bandwidth constraints on problems complete for polynomial timeSUDBOROUGH, I. H.Theoretical computer science. 1983, Vol 26, Num 1-2, pp 25-52, issn 0304-3975Article

Admissible representations of effective cpo'sWEIHRAUCH, K; SCHÄFER, G.Theoretical computer science. 1983, Vol 26, Num 1-2, pp 131-147, issn 0304-3975Article

Some consequences of non-uniform conditions on uniform classesYAP, C. K.Theoretical computer science. 1983, Vol 26, Num 3, pp 287-300, issn 0304-3975Article

On the arithmetic complexicity of matrix Kronecker powersSEROUSSI, G; MA, F.Information processing letters. 1983, Vol 17, Num 3, pp 145-148, issn 0020-0190Article

Perfect stables in graphsCROITORU, C; SUDITU, E.Information processing letters. 1983, Vol 17, Num 1, pp 53-56, issn 0020-0190Article

Logical approaches to computational barriers (Second conference on computability in Europe, CiE 2006, Swansea, UK, June 30 - July 5, 2006)Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-35466-2, 1Vol, XV-608 p, isbn 3-540-35466-2Conference Proceedings

Space bounds for infinitary computationLOWE, Benedikt.Lecture notes in computer science. 2006, pp 319-329, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 11 p.Conference Paper

Computing sums of order-K Fibonacci numbers in log timeER, M. C.Information processing letters. 1983, Vol 17, Num 1, pp 1-5, issn 0020-0190Article

Infinite time register machinesKOEPKE, Peter.Lecture notes in computer science. 2006, pp 257-266, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 10 p.Conference Paper

Two open problems on effective dimensionMAYORDOMO, Elvira.Lecture notes in computer science. 2006, pp 353-359, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 7 p.Conference Paper

What does the incompleteness theorem add to the unsolvability of the halting problem?FRANZEN, Torkel.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-35466-2, 1Vol, p. 198Conference Paper

Algorithms for the certified write-all problemANDERSON, R. J; WOLL, H.SIAM journal on computing (Print). 1997, Vol 26, Num 5, pp 1277-1283, issn 0097-5397Article

On the computability of circumscriptionKRISHNAPRASAD, T.Information processing letters. 1988, Vol 27, Num 5, pp 237-243, issn 0020-0190Article

Co-total enumeration degreesSOLON, Boris.Lecture notes in computer science. 2006, pp 538-545, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 8 p.Conference Paper

GÖDEL ET LA THÈSE DE TURING = Gödel and Turing's thesisCASSOU-NOGUES, Pierre.Revue d'histoire des mathématiques. 2008, Vol 14, Num 1, pp 77-111, issn 1262-022X, 35 p.Article

The logical strength of the uniform continuity theoremBERGER, Josef.Lecture notes in computer science. 2006, pp 35-39, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 5 p.Conference Paper

The standard logic of Z is inconsistentHENSON, M. C.Formal aspects of computing. 1998, Vol 10, Num 3, pp 243-247, issn 0934-5043Article

On the Jacopini techniqueKUPER, J.Information and computation (Print). 1997, Vol 138, Num 2, pp 101-123, issn 0890-5401Article

Structured calculational proofBACK, R; GRUNDY, J; VON WRIGHT, J et al.Formal aspects of computing. 1997, Vol 9, Num 5-6, pp 469-483, issn 0934-5043Article

Computability of physical operationsPOSIEWNIK, A.International journal of theoretical physics. 1988, Vol 27, Num 1, pp 83-88, issn 0020-7748Article

Comments on: the computation of the convex hull of a simple polygon in linear timeELGINDY, H.Computers and artificial intelligence. 1987, Vol 6, Num 5, pp 437-440, issn 0232-0274Article

Forcing with random variables and proof complexityKRAJICEK, Jan.Lecture notes in computer science. 2006, pp 277-278, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 2 p.Conference Paper

Degrees of weakly computable realsKENG MENG NG; STEPHAN, Frank; GUOHUA WU et al.Lecture notes in computer science. 2006, pp 413-422, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 10 p.Conference Paper

Page / 39